Deblurring and Denoising of Maps between Shapes

نویسندگان

  • Danielle Ezuz
  • Mirela Ben-Chen
چکیده

Shape correspondence is an important and challenging problem in geometry processing. Generalized map representations, such as functional maps, have been recently suggested as an approach for handling difficult mapping problems, such as partial matching and matching shapes with high genus, within a generic framework. While this idea was shown to be useful in various scenarios, such maps only provide low frequency information on the correspondence. In many applications, such as texture transfer and shape interpolation, a high quality pointwise map that can transport high frequency data between the shapes is required. We name this problem map deblurring and propose a robust method, based on a smoothness assumption, for its solution. Our approach is suitable for non-isometric shapes, is robust to mesh tessellation and accurately recovers vertex-to-point, or precise, maps. Using the same framework we can also handle map denoising, namely improvement of given pointwise maps from various sources. We demonstrate that our approach outperforms the state-of-the-art for both deblurring and denoising of maps on benchmarks of non-isometric shapes, and show an application to high quality intrinsic symmetry computation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

One-Step Deblurring and Denoising Color Images Using Partial Differential Equations

nonlinear diffusion filtering, deblurring, denoising An implicit, one-step method for the restoration of blurred and noisy color images is presented. Using a nonlinear partial differential equation (PDE)-based variational restoration approach, it is shown that a single iteration yields a result that is visually superior to performing Gaussian low-pass filtering, followed up by unsharp masking, ...

متن کامل

Alternating Krylov subspace image restoration methods

Alternating methods for image deblurring and denoising have recently received considerable attention. The simplest of these methods are two-way methods that restore contaminated images by alternating between deblurring and denoising. This paper describes Krylov subspace-based two-way alternating iterative methods that allow the application of regularization operators different from the identity...

متن کامل

Solving Variational Problems in Image Processing via Projections A Common View on TV Denoising and Wavelet Shrinkage

Variational methods are very common in image processing. They are used for denoising, deblurring, segmentation or inpainting. In this short paper we review a method for the solution of a special class of variational problems, presented in [2]. We show applications to TV denoising and new applications to total variation deblurring, wavelet shrinkage and texture extraction. Moreover this approach...

متن کامل

A Multilevel Algorithm for Simultaneously Denoising and Deblurring Images

In this paper, we develop a fast multilevel algorithm for simultaneously denoising and deblurring images under the total-variation regularization. Although much effort has been devoted to developing fast algorithms for the numerical solution and the denoising problem was satisfactorily solved, fast algorithms for the combined denoising and deblurring model remain to be a challenge. Recently sev...

متن کامل

Iterative Algorithms Based on Decoupling of Deblurring and Denoising for Image Restoration

In this paper, we propose iterative algorithms for solving image restoration problems. The iterative algorithms are based on decoupling of deblurring and denoising steps in the restoration process. In the deblurring step, an efficient deblurring method using fast transforms can be employed. In the denoising step, effective methods such as the wavelet shrinkage denoising method or the total vari...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2017